Quantum algorithmic randomness

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum mechanics and algorithmic randomness

A long sequence of tosses of a classical coin produces an apparently random bit string, but classical randomness is an illusion: the algorithmic information content of a classically-generated bit string lies almost entirely in the description of initial conditions. This letter presents a simple argument that, by contrast, a sequence of bits produced by tossing a quantum coin is, almost certainl...

متن کامل

Algorithmic Randomness , Quantum Physics , and Incompleteness C

Is randomness in quantum mechanics “algorithmically random”? Is there any relation between Heisenberg’s uncertainty relation and Gödel’s incompleteness? Can quantum randomness be used to trespass the Turing’s barrier? Can complexity shed more light on incompleteness? In this paper we use variants of “algorithmic complexity” to discuss the above questions.

متن کامل

Algorithmic Randomness, Quantum Physics, and Incompleteness

Is randomness in quantum mechanics “algorithmically random”? Is there any relation between Heisenberg’s uncertainty relation and Gödel’s incompleteness? Can quantum randomness be used to trespass the Turing’s barrier? Can complexity shed more light on incompleteness? In this paper we use variants of “algorithmic complexity” to discuss the above questions.

متن کامل

The algorithmic randomness of quantum measurements

This paper is a comment on the paper “Quantum Mechanics and Algorithmic Randomness” was written by Ulvi Yurtsever [1] and the briefly explanation of the algorithmic randomness of quantum measurements results. There are differences between the computability of probability sources, ( which means there is an algorithm that can define the way that random process or probability source generates the ...

متن کامل

Algorithmic randomness and lowness

We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterization of these sets and show that they all have Turing degree incomparable to 0 0. This contrasts with a result of Ku cera and Terwijn 2] on sets that are low for the class of Martin-LL of random reals. The Cantor space 2 ! is the set of innnite binar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Physics

سال: 2021

ISSN: 0022-2488,1089-7658

DOI: 10.1063/5.0003351